InforLorV4, Main, Exploration, bibRecord, 002642

Refinement-Based Verification of Local Synchronization Algorithms

Identifieur interne : 002642 ( Main/Exploration ); précédent : 002641; suivant : 002643

Refinement-Based Verification of Local Synchronization Algorithms

Auteurs : Dominique Méry [France] ; Mohamed Mosbah [France] ; Mohamed Tounsi [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:54D0C1F8DAE248B69BED22FE1F7F62451F86D117

Abstract

Abstract: Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.

Url:

https://api.istex.fr/ark:/67375/HCB-WF08XTPX-T/fulltext.pdf

DOI: 10.1007/978-3-642-21437-0_26

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 001387
to stream Istex, to step Curation: 001370
to stream Istex, to step Checkpoint: 000542
to stream Main, to step Merge: 002684
to stream Main, to step Curation: 002642

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Refinement-Based Verification of Local Synchronization Algorithms</title>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation><country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="team" n="7">Mosel (Loria)</orgName>
<orgName type="lab">Laboratoire lorrain de recherche en informatique et ses applications</orgName>
<orgName type="university">Université de Lorraine</orgName>
<orgName type="EPST">Centre national de la recherche scientifique</orgName>
<orgName type="EPST">Institut national de recherche en informatique et en automatique</orgName>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohamed" sort="Mosbah, Mohamed" uniqKey="Mosbah M" first="Mohamed" last="Mosbah">Mohamed Mosbah</name>
</author>
<author><name sortKey="Tounsi, Mohamed" sort="Tounsi, Mohamed" uniqKey="Tounsi M" first="Mohamed" last="Tounsi">Mohamed Tounsi</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:54D0C1F8DAE248B69BED22FE1F7F62451F86D117</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-21437-0_26</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-WF08XTPX-T/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001387</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001387</idno>
<idno type="wicri:Area/Istex/Curation">001370</idno>
<idno type="wicri:Area/Istex/Checkpoint">000542</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000542</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Mery D:refinement:based:verification</idno>
<idno type="wicri:Area/Main/Merge">002684</idno>
<idno type="wicri:Area/Main/Curation">002642</idno>
<idno type="wicri:Area/Main/Exploration">002642</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Refinement-Based Verification of Local Synchronization Algorithms</title>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>Loria, Université Henri Poincaré Nancy 1</wicri:regionArea>
<wicri:noRegion>Université Henri Poincaré Nancy 1</wicri:noRegion>
<wicri:noRegion>Université Henri Poincaré Nancy 1</wicri:noRegion>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="team" n="7">Mosel (Loria)</orgName>
<orgName type="lab">Laboratoire lorrain de recherche en informatique et ses applications</orgName>
<orgName type="university">Université de Lorraine</orgName>
<orgName type="EPST">Centre national de la recherche scientifique</orgName>
<orgName type="EPST">Institut national de recherche en informatique et en automatique</orgName>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohamed" sort="Mosbah, Mohamed" uniqKey="Mosbah M" first="Mohamed" last="Mosbah">Mohamed Mosbah</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université Bordeaux 1</wicri:regionArea>
<wicri:noRegion>Université Bordeaux 1</wicri:noRegion>
<wicri:noRegion>Université Bordeaux 1</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Tounsi, Mohamed" sort="Tounsi, Mohamed" uniqKey="Tounsi M" first="Mohamed" last="Tounsi">Mohamed Tounsi</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université Bordeaux 1</wicri:regionArea>
<wicri:noRegion>Université Bordeaux 1</wicri:noRegion>
<wicri:noRegion>Université Bordeaux 1</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
<orgName><li>Centre national de la recherche scientifique</li>
<li>Institut national de recherche en informatique et en automatique</li>
<li>Laboratoire lorrain de recherche en informatique et ses applications</li>
<li>Mosel (Loria)</li>
<li>Université de Lorraine</li>
</orgName>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
</region>
<name sortKey="Mosbah, Mohamed" sort="Mosbah, Mohamed" uniqKey="Mosbah M" first="Mohamed" last="Mosbah">Mohamed Mosbah</name>
<name sortKey="Tounsi, Mohamed" sort="Tounsi, Mohamed" uniqKey="Tounsi M" first="Mohamed" last="Tounsi">Mohamed Tounsi</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002642 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002642 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:54D0C1F8DAE248B69BED22FE1F7F62451F86D117
   |texte=   Refinement-Based Verification of Local Synchronization Algorithms
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Refinement-Based Verification of Local Synchronization Algorithms

Refinement-Based Verification of Local Synchronization Algorithms

Source :

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri